Modal-Epistemic Arithmetic and the problem of quantifying in

نویسنده

  • Jan Heylen
چکیده

The subject of this article is Modal-Epistemic Arithmetic, a theory introduced by Horsten to interpret Epistemic Arithmetic, which in turn was introduced by Shapiro to interpret Heyting Arithmetic. I will show how to interpret Modal-Epistemic Arithmetic in Epistemic Arithmetic and I will show how to get rid of a particular Platonist assumption. Then I will discuss models for Modal-Epistemic Arithmetic in light of the problems of logical omniscience and logical competence. Awareness models, impossible worlds models and syntactical models have been introduced to deal with the first problem. Certain conditions on the accessibility relations are needed to deal with the second problem. I go on to argue that those models are subject to the problem of quantifying in, for which I will provide a solution.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Comparative Analysis of Epistemic and Root Modality in Two selected English Books in the Field of Applied Linguistics Written by English Native and Iranian Non-native Writers

Academic discourse has always been the focus of many linguists, especially those who have been involved with English for Academic Purposes (EAP) and discourse analysis. Persuasion, as part of rhetorical structure of academic writing, is partly achieved by employing modality markers.  Adopting a descriptive design, the present study was carried out to compare the use of modality markers in terms...

متن کامل

The undecidability of group announcements

This paper addresses and solves the long-standing open problem of whether Group Announcement Logic (GAL) is decidable. GAL is a dynamic epistemic logic for reasoning about which states of knowledge a group of agents can make come about by sharing their knowledge, with an operator for quantifying over all truthful public announcements that can be made by the group. We show that the satisfiabilit...

متن کامل

Comparing uncertainty data in epistemic and ontic sense used to decision making problem

In the paper aspect of comparability alternatives in decision making problem by imprecise or incomplete information isexamined. In particular, new definitions of transitivity based on the measure of the intensity preference between pairsof alternatives in epistemic and ontic case is presented and its application to solve decision making problem is proposed.

متن کامل

On the Impact of Modal Depth in Epistemic Planning

Epistemic planning is a variant of automated planning in the framework of dynamic epistemic logic. In recent works, the epistemic planning problem has been proved to be undecidable when preconditions of events can be epistemic formulas of arbitrary complexity, and in particular arbitrary modal depth. It is known however that when preconditions are propositional (and there are no postconditions)...

متن کامل

A Logic of Knowledge and Strategies with Imperfect Information

In this paper we put forward Epistemic Strategy Logic (ESL), a logic of knowledge and strategies in contexts of imperfect information. ESL extends Strategy Logic by adding modal operators for individual and collective knowledge. This enhanced framework allows us to represent explicitly and to reason about the knowledge agents have of their own and other agents’ strategies. We provide a semantic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Synthese

دوره 190  شماره 

صفحات  -

تاریخ انتشار 2013